Polynomial-time approximation algorithms for weighted LCS problem
نویسندگان
چکیده
منابع مشابه
Polynomial-Time Approximation Algorithms for Weighted LCS Problem
We deal with a variant of the well-known Longest Common Subsequence (LCS) problem for weighted sequences. A (biological) weighted sequence determines the probability for each symbol to occur at a given position of the sequence (such sequences are also called Position Weighted Matrices, PWM). Two possible such versions of the problem were proposed by (Amir et al., 2009 and 2010), they are called...
متن کاملPolynomial-Time Approximation Algorithms
• Assume that the input is random, and find an algorithm that will perform well in the average case. For example, the maximum clique problem, which is NP -hard, can actually be solved efficiently assuming a random input because the maximum clique in a randomly chosen graph is small. This assumption is often used in practice, but the problem is that not everyone will agree on whether the input d...
متن کاملEfficient polynomial-time algorithms for the constrained LCS problem with strings exclusion
In this paper,we revisit a recent variant of the longest common subsequence (LCS) problem, the string-excluding constrainedLCS (STR-EC-LCS) problem,which was first addressed by Chen and Chao (J Comb Optim 21(3):383–392, 2011). Given two sequences X and Y of lengths m and n, respectively, and a constraint string P of length r, we are to find a common subsequence Z of X and Y which excludes P as ...
متن کاملEfficient Polynomial-Time Algorithms for Variants of the Multiple Constrained LCS Problem
In this paper, we revisit a recent variant of the longest common subsequence problem, the string-excluding constrained LCS (STR-EC-LCS) problem, which was first addressed by Chen and Chao [Journal of Combinatorial Optimization, 21(3), 2011]. Given two sequences X and Y of lengths n and m, respectively, and a constraint string P of length r, we are to find a common subsequence Z of X and Y which...
متن کاملCsc5160: Combinatorial Optimization and Approximation Algorithms Topic: Polynomial Time Approximation Scheme 17.1 Polynomial Time Approximation Scheme 17.2 Knapsack Problem
In previous chapters we have seen the definition of a constant factor approximation algorithm. In this chapter, we will introduce the notion of a polynomial time approximation scheme (PTAS), which allows approximability to any required degree. To illustrate how PTAS works, we will study two examples, including the knapsack problem and the bin packing problem. The dynamic programming technique w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.11.011